منابع مشابه
Computational Complexity of Simple P Systems
We introduce a new class of membrane systems called simple P systems, and study its computational complexity using the classical theory. We start by presenting the knapsack problem and analyzing its space and time complexities. Then we study the computational complexity of simple P systems by considering the static allocation of resources enabling the parallel application of the rules. We show ...
متن کاملPolarizationless P Systems with Active Membranes: Computational Complexity Aspects
P systems with active membranes, in their classical definition, make use of noncooperative rules only. However, it is well known that in living cells, proteins interact among them yielding new products. Inspired by this biological phenomenon, the previous framework is reformulated in this paper, allowing cooperation in object evolution rules, while removing electrical charges associated with me...
متن کاملA reduction of proof complexity to computational complexity for $AC^0[p]$ Frege systems
We give a general reduction of lengths-of-proofs lower bounds for constant depth Frege systems in DeMorgan language augmented by a connective counting modulo a prime p (the so called AC[p] Frege systems) to computational complexity lower bounds for search tasks involving search trees branching upon values of maps on the vector space of low degree polynomials over Fp. In 1988 Ajtai [2] proved th...
متن کاملThe Computational Complexity of Evolving Systems
The work in this thesis has been carried out under the auspices of the research school IPA (Institute for Programming research and Algorithmics). Introduction Models for computational devices are crucial to many fields of computer science. Without a suitable model, there is no foundation to base one's theories on. Choosing a proper model for a computational phenomenon is not an easy task. If th...
متن کاملOn the computational complexity of membrane systems
We show how techniques in machine-based complexity can be used to analyze the complexity of membrane computing systems. We focus on catalytic systems, communicating P systems, and systems with only symport/antiport rules, but our techniques are applicable to other P systems that are universal. We de/ne space and time complexity measures and show hierarchies of complexity classes similar to well...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Scholarpedia
سال: 2009
ISSN: 1941-6016
DOI: 10.4249/scholarpedia.9290